On-line windows scheduling of temporary itemsCHAN, Wun-Tat; WONG, Prudence W. H.Lecture notes in computer science. 2004, pp 259-270, issn 0302-9743, isbn 3-540-24131-0, 12 p.Conference Paper

New results on the k-Truck ProblemWEIMIN MA; YINFENG XU; YOU, Jane et al.Lecture notes in computer science. 2002, pp 504-513, issn 0302-9743, isbn 3-540-43996-X, 10 p.Conference Paper

Optimal on-line algorithms to minimize makespan on two machines with resource augmentationEPSTEIN, Leah; GANOT, Arik.Lecture notes in computer science. 2004, pp 109-122, issn 0302-9743, isbn 3-540-21079-2, 14 p.Conference Paper

Analyses on the generalised lotto-type competitive learningLUK, Andrew.Lecture notes in computer science. 2000, pp 9-16, issn 0302-9743, isbn 3-540-41450-9Conference Paper

Improved randomized on-line algorithms for the list update problemALBERS, S.SIAM journal on computing (Print). 1998, Vol 27, Num 3, pp 682-693, issn 0097-5397Article

Uniform multipaging reduces to pagingLIBERATORE, V.Information processing letters. 1998, Vol 67, Num 1, pp 9-12, issn 0020-0190Article

The relative worst order ratio applied to seat reservationBOYAR, Joan; MEDVEDEV, Paul.Lecture notes in computer science. 2004, pp 90-101, issn 0302-9743, isbn 3-540-22339-8, 12 p.Conference Paper

Online scheduling of parallel communications with individual deadlinesLEE, J.-H; CHWA, K.-Y.Lecture notes in computer science. 1999, pp 383-392, issn 0302-9743, isbn 3-540-66916-7Conference Paper

A variant of the arrow distributed directory with low average complexityPELEG, D; RESHEF, E.Lecture notes in computer science. 1999, pp 615-624, issn 0302-9743, isbn 3-540-66224-3Conference Paper

Using competitive learning in neural networks for cluster-detection-and-labeling: Extended summaryCHEN, W.-G; OUYANG, C.-S; LEE, S.-J et al.Lecture notes in computer science. 1999, pp 492-493, issn 0302-9743, isbn 3-540-66822-5Conference Paper

Speed scaling for stretch plus energyCOLE, Daniel; IM, Sungjin; MOSELEY, Benjamin et al.Operations research letters. 2012, Vol 40, Num 3, pp 180-184, issn 0167-6377, 5 p.Article

On-line grid-packing with a single active gridFUJITA, Satoshi.Lecture notes in computer science. 2002, pp 476-483, issn 0302-9743, isbn 3-540-43996-X, 8 p.Conference Paper

Competitive learning methods for efficient vector quantizations in a speech recognition environmentCURATELLI, F; MAYORA-IBARRA, O.Lecture notes in computer science. 2000, pp 108-114, issn 0302-9743, isbn 3-540-67354-7Conference Paper

On the competitiveness of the move-to-front ruleMARTINEZ, C; ROURA, S.Theoretical computer science. 2000, Vol 242, Num 1-2, pp 313-325, issn 0304-3975Article

Carrying umbrellas : An online relocation problem on graphsLEE, J.-H; PARK, C.-D; CHWA, K.-Y et al.Lecture notes in computer science. 1999, pp 195-204, issn 0302-9743, isbn 3-540-66916-7Conference Paper

A message authentication code based on unimodular matrix groupsCARY, Matthew; VENKATESAN, Ramarathnam.Lecture notes in computer science. 2003, pp 500-512, issn 0302-9743, isbn 3-540-40674-3, 13 p.Conference Paper

Scheduling broadcasts with deadlinesKIM, Jae-Hoon; CHWA, Kyung-Yong.Lecture notes in computer science. 2003, pp 415-424, issn 0302-9743, isbn 3-540-40534-8, 10 p.Conference Paper

Preemptive scheduling in overloaded systemsCHROBAK, Marek; EPSTEIN, Leah; NOGA, John et al.Lecture notes in computer science. 2002, pp 800-811, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

BDD-based decision procedures for κGUOQIANG PAN; SATTLER, Ulrike; VARDI, Moshe Y et al.Lecture notes in computer science. 2002, pp 16-30, issn 0302-9743, isbn 3-540-43931-5, 15 p.Conference Paper

Towards fewer parameters for SAT clause weighting algorithmsTHORNTON, John; PULLAN, Wayne; TERRY, Justin et al.Lecture notes in computer science. 2002, pp 569-578, issn 0302-9743, isbn 3-540-00197-2, 10 p.Conference Paper

On-demand broadcasting under deadlineKALYANASUNDARAM, Bala; VELAUTHAPILLAI, Mahe.Lecture notes in computer science. 2003, pp 313-324, issn 0302-9743, isbn 3-540-20064-9, 12 p.Conference Paper

Competitive analysis of the LRFU paging algorithmCOHEN, E; KAPLAN, H; ZWICK, U et al.Algorithmica. 2002, Vol 33, Num 4, pp 511-516, issn 0178-4617Article

Randomized weighted caching with two page weightsIRANI, S.Algorithmica. 2002, Vol 32, Num 4, pp 624-640, issn 0178-4617Article

Online independent setsHALLDORSSON, M. M; IWAMA, K; MIYAZAKI, S et al.Lecture notes in computer science. 2000, pp 202-209, issn 0302-9743, isbn 3-540-67787-9Conference Paper

On list update and work function algorithmsANDERSON, E. J; HILDRUM, K; KARLIN, A. R et al.Lecture notes in computer science. 1999, pp 289-300, issn 0302-9743, isbn 3-540-66251-0Conference Paper